Accepting grammars and systems

We investigate several kinds of regulated rewriting (programmed, matrix, with regular control, ordered, and variants thereof) and of parallel rewriting mechanisms (Lindenmayer systems, uniformly limited Lindenmayer systems, limited Lindenmayer systems and scattered context grammars) as accepting devices, in contrast with the usual generating mode. In some cases, accepting mode turns out to be just as powerful as generating mode, e.g. within the grammars of the Chomsky hierarchy, within random context, regular control, L systems, uniformly limited L systems, scattered context. Most of these equivalences can be proved using a metatheorem on so-called context condition grammars. In case of matrix grammars and programmed grammars without appearance checking, a straightforward construction leads to the desired equivalence result. Interestingly, accepting devices are (strictly) more powerful than their generating counterparts in case of ordered grammars, programmed and matrix grammars with appearance checking (even programmed grammarsm with unconditional transfer), and 1lET0L systems. More precisely, if we admit erasing productions, we arrive at new characterizations of the recursivley enumerable languages, and if we do not admit them, we get new characterizations of the context-sensitive languages. Moreover, we supplement the published literature showing: - The emptiness and membership problems are recursivley solvable for generating ordered grammars, even if we admit erasing productions. - Uniformly limited propagating systems can be simulated by programmed grammars without erasing and without appearance checking, hence the emptiness and membership problems are recursively solvable for such systems. - We briefly discuss the degree of nondeterminism and the degree of synchronization for devices with limited parallelism

On the number of components in cooperating distributed grammar systems

AbstractIt is proved that the number of components in context-free cooperating distributed (CD) grammar systems can be reduced to 3 when they are working in the so-called sf-mode of derivation, which is the cooperation protocol which has been considered first for CD grammar systems. In this derivation mode, a component continues the derivation until and unless there is a nonterminal in the sentential form which cannot be rewritten according to that component. Moreover, it is shown that CD grammar systems in sf-mode with only one component can generate only the context-free languages but they can generate non-context-free languages if two components are used. The sf-mode of derivation is compared with other well-known cooperation protocols with respect to the hierarchies induced by the number of components

Measuring Communication in Parallel Communicating Finite Automata

Systems of deterministic finite automata communicating by sending their states upon request are investigated, when the amount of communication is restricted. The computational power and decidability properties are studied for the case of returning centralized systems, when the number of necessary communications during the computations of the system is bounded by a function depending on the length of the input. It is proved that an infinite hierarchy of language families exists, depending on the number of messages sent during their most economical recognitions. Moreover, several properties are shown to be not semi-decidable for the systems under consideration.Comment: In Proceedings AFL 2014, arXiv:1405.527

For none, one, or two polarities—How do POLO junctions fit best into industrial Si solar cells?

We present a systematic study on the benefit of the implementation of poly-Si on oxide (POLO) or related junctions into p-type industrial Si solar cells as compared with the benchmark of Passivated Emitter and Rear Cell (PERC). We assess three aspects: (a) the simulated efficiency potential of representative structures with POLO junctions for none (=PERC+), one, and for two polarities; (b) possible lean process flows for their fabrication; and (c) experimental results on major building blocks. Synergistic efficiency gain analysis reveals that the exclusive suppression of the contact recombination for one polarity by POLO only yields moderate efficiency improvements between 0.23%abs and 0.41%abs as compared with PERC+ because of the remaining recombination paths. This problem is solved in a structure that includes POLO junctions for both polarities (POLO2), for whose realization we propose a lean process flow, and for which we experimentally demonstrate the most important building blocks. However, two experimental challenges—alignment tolerances and screen-print metallization of p+ poly-Si—are unsolved so far and reduced the efficiency of the “real” POLO2 cell as compared with an idealized scenario. As an intermediate step, we therefore work on a POLO IBC cell with POLO junctions for one polarity. It avoids the abovementioned challenges of the POLO2 structure, can be realized within a lean process flow, and has an efficiency benefit of 1.59%abs as compared with PERC—because not only contact recombination is suppressed but also the entire phosphorus emitter is replaced by an n+ POLO junction